Exponential algorithmic speedup by quantum walk Andrew
نویسندگان
چکیده
Andrew M. Childs,1, ∗ Richard Cleve,2, † Enrico Deotto,1, ‡ Edward Farhi,1, § Sam Gutmann,3, ¶ and Daniel A. Spielman4, ∗∗ Center for Theoretical Physics, Massachusetts Institute of Technology, Cambridge, MA 02139, USA Department of Computer Science, University of Calgary, Calgary, Alberta, Canada T2N 1N4 Department of Mathematics, Northeastern University, Boston, MA 02115, USA Department of Mathematics, Massachusetts Institute of Technology, Cambridge, MA 02139, USA (25 October 2002)
منابع مشابه
Quantum Information Processing in Continuous Time
Quantum mechanical computers can solve certain problems asymptotically faster than any classical computing device. Several fast quantum algorithms are known, but the nature of quantum speedup is not well understood, and inventing new quantum algorithms seems to be difficult. In this thesis, we explore two approaches to designing quantum algorithms based on continuous-time Hamiltonian dynamics. ...
متن کاملQuantum walk speedup of backtracking algorithms
We describe a general method to obtain quantum speedups of classical algorithms which are based on the technique of backtracking, a standard approach for solving constraint satisfaction problems (CSPs). Backtracking algorithms explore a tree whose vertices are partial solutions to a CSP in an attempt to find a complete solution. Assume there is a classical backtracking algorithm which finds a s...
متن کاملQuantum speedup of classical mixing processes ∗
It is known that repeated measurements performed at uniformly random times enable the continuous-time quantum walk on a finite set S (using a stochastic transition matrix P as the time-independent Hamiltonian) to sample almost uniformly from S provided that P does. Here we show that the same phenomenon holds for other (discrete-time) walk variants and more general measurements types, then focus...
متن کاملSe p 20 06 Quantum speedup of classical mixing processes ∗
It is known that repeated measurements performed at uniformly random times enable the continuous-time quantum walk on a finite set S (using a stochastic transition matrix P as the time-independent Hamiltonian) to sample almost uniformly from S provided that P does. Here we show that the same phenomenon holds for other (discrete-time) walk variants and more general measurements types, then focus...
متن کاملIntricacies of quantum computational paths
Graph search represents a cornerstone in computer science and is employed when the best algorithmic solution to a problem consists in performing an analysis of a search space representing computational possibilities. Typically, in such problems it is crucial to determine the sequence of transitions performed that led to certain states. In this work we discuss how to adapt generic quantum search...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008